7 research outputs found

    Improved Lower Bounds on the Compatibility of Multi-State Characters

    Full text link
    We study a long standing conjecture on the necessary and sufficient conditions for the compatibility of multi-state characters: There exists a function f(r)f(r) such that, for any set CC of rr-state characters, CC is compatible if and only if every subset of f(r)f(r) characters of CC is compatible. We show that for every r≥2r \ge 2, there exists an incompatible set CC of ⌊r2⌋⋅⌈r2⌉+1\lfloor\frac{r}{2}\rfloor\cdot\lceil\frac{r}{2}\rceil + 1 rr-state characters such that every proper subset of CC is compatible. Thus, f(r)≥⌊r2⌋⋅⌈r2⌉+1f(r) \ge \lfloor\frac{r}{2}\rfloor\cdot\lceil\frac{r}{2}\rceil + 1 for every r≥2r \ge 2. This improves the previous lower bound of f(r)≥rf(r) \ge r given by Meacham (1983), and generalizes the construction showing that f(4)≥5f(4) \ge 5 given by Habib and To (2011). We prove our result via a result on quartet compatibility that may be of independent interest: For every integer n≥4n \ge 4, there exists an incompatible set QQ of ⌊n−22⌋⋅⌈n−22⌉+1\lfloor\frac{n-2}{2}\rfloor\cdot\lceil\frac{n-2}{2}\rceil + 1 quartets over nn labels such that every proper subset of QQ is compatible. We contrast this with a result on the compatibility of triplets: For every n≥3n \ge 3, if RR is an incompatible set of more than n−1n-1 triplets over nn labels, then some proper subset of RR is incompatible. We show this upper bound is tight by exhibiting, for every n≥3n \ge 3, a set of n−1n-1 triplets over nn taxa such that RR is incompatible, but every proper subset of RR is compatible

    A Simple Characterization of the Minimal Obstruction Sets for Three-State Perfect Phylogenies

    Get PDF
    Lam, Gusfield, and Sridhar (2009) showed that a set of three-state characters has a perfect phylogeny if and only if every subset of three characters has a perfect phylogeny. They also gave a complete characterization of the sets of three three-state characters that do not have a perfect phylogeny. However, it is not clear from their characterization how to find a subset of three characters that does not have a perfect phylogeny without testing all triples of characters. In this note, we build upon their result by giving a simple characterization of when a set of three-state characters does not have a perfect phylogeny that can be inferred from testing all pairs of characters

    Contributions to computational phylogenetics and algorithmic self-assembly

    Get PDF
    This dissertation addresses some of the algorithmic and combinatorial problems at the interface between biology and computation. In particular, it focuses on problems in both computational phylogenetics, an area of study in which computation is used to better understand evolutionary relationships, and algorithmic self-assembly, an area of study in which biological processes are used to perform computation. The first set of results investigate inferring phylogenetic trees from multi-state character data. We give a novel characterization of when a set of three-state characters has a perfect phylogeny and make progress on a long-standing conjecture regarding the compatibility of multi-state characters. The next set of results investigate inferring phylogenetic supertrees from collections of smaller input trees when the input trees do not fully agree on the relative positions of the taxa. Two approaches to dealing with such conflicting input trees are considered. The first is to contract a set of edges in the input trees so that the resulting trees have an agreement supertree. The second is to remove a set of taxa from the input trees so that the resulting trees have an agreement supertree. We give fixed-parameter tractable algorithms for both approaches. We then turn to the algorithmic self-assembly of fractal structures from DNA tiles and investigate approximating the Sierpinski triangle and the Sierpinski carpet with strict self-assembly. We prove tight bounds on approximating the Sierpinski triangle and exhibit a class of fractals that are generalizations of the Sierpinski carpet that can approximately self-assemble. We conclude by discussing some ideas for further research.</p
    corecore